Three-Step Iterative Method for Solving Nonlinear Equations
نویسنده
چکیده
In this paper, a published algorithm is investigated that proposes a three-step iterative method for solving nonlinear equations. This method is considered to be efficient with third order of convergence and an improvement to previous methods. This paper proves that the order of convergence of the previous scheme is two, and the efficiency index is less than the corresponding Newton’s method. In addition, the three-step iterative method of the scheme is implemented, and the previously published numerical results are found to be incorrect. Furthermore, this paper presents a new three-step iterative method with third order of convergence for solving nonlinear equations. The same numerical examples previously presented in literature are used in this study to correct those results and to illustrate the efficiency and performance of the new method.
منابع مشابه
Solving System of Nonlinear Equations by using a New Three-Step Method
In this paper, we suggest a fifth order convergence three-step method for solving system of nonlinear equations. Each iteration of the method requires two function evaluations, two first Fr'{e}chet derivative evaluations and two matrix inversions. Hence, the efficiency index is $5^{1/({2n+4n^{2}+frac{4}{3}n^{3}})}$, which is better than that of other three-step methods. The advant...
متن کاملAN ITERATIVE METHOD WITH SIX-ORDER CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS
Modification of Newtons method with higher-order convergence is presented. The modification of Newtons method is based on Frontinis three-order method. The new method requires two-step per iteration. Analysis of convergence demonstrates that the order of convergence is 6. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newtons method and ...
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملA NEW TWO STEP CLASS OF METHODS WITH MEMORY FOR SOLVING NONLINEAR EQUATIONS WITH HIGH EFFICIENCY INDEX
It is attempted to extend a two-step without memory method to it's with memory. Then, a new two-step derivative free class of without memory methods, requiring three function evaluations per step, is suggested by using a convenient weight function for solving nonlinear equations. Eventually, we obtain a new class of methods by employing a self-accelerating parameter calculated in each iterative...
متن کاملA SIXTH ORDER METHOD FOR SOLVING NONLINEAR EQUATIONS
In this paper, we present a new iterative method with order of convergence eighth for solving nonlinear equations. Periteration this method requires three evaluations of the function and one evaluation of its first derivative. A general error analysis providing the eighth order of convergence is given. Several numerical examples are given to illustrate the efficiency and performance of the new ...
متن کاملA Three-Point Iterative Method for Solving Nonlinear Equations with High Efficiency Index
In this paper, we proposed a three-point iterative method for finding the simple roots of non- linear equations via mid-point and interpolation approach. The method requires one evaluation of the derivative and three(3) functions evaluation with efficiency index of 81/4 ≈ 1.682. Numerical results reported here, between the proposed method with some other existing methods shows that our method i...
متن کامل